Generalized hypercube graph $\Q_n(S)$, graph products and self-orthogonal codes
نویسندگان
چکیده
منابع مشابه
Codes And Xor Graph Products
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3(n), of vectors in {0, 1, 2}n such that the Hamming distance between every two is odd? We investigate these questions, and more general ones, by studying Xor powers of graphs, focusing on their independence number and ...
متن کاملGraph-based Codes and Generalized Product Constructions
Fountain codes are a class of rateless codes well-suited for communication over erasure channels with unknown erasure parameter. We analyze the decoding of LT codes, the first instance of practical, universal Fountain codes. A set of interest during LT decoding is the set of output symbols of reduced degree one (the “ripple”). The evolution of the ripple size throughout the decoding process is ...
متن کاملEdge distribution in generalized graph products
Given a graph G and a natural number k, the k graph product of G = (V,E) is the graph with vertex set V . For every two vertices x = (x1, . . . , xk) and y = (y1, . . . , yk) in V , an edge is placed according to a predefined rule. Graph products are a basic combinatorial object, widely studied and used in different areas such as hardness of approximation, information theory, etc. We study grap...
متن کاملThe Hypercube Graph and the Inhibitory Hypercube Network
In this paper we review the spectral properties of the hypercube graph Qn and derive the Walsh functions as eigenvectors of the adjacency matrix. We then interpret the Walsh functions as states of the hypercube, with vertices labeled +1 and -1, and elucidate the regularity of the induced vertex neighborhoods and subcubes. We characterize the neighborhoods of each vertex in terms of the number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2016
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.13099